<title>合唱队形</title><link href="http://hzoi.com/tomorrow.css" rel="stylesheet"><div class="ui existing segment"><pre><code><span class="pl-cp">#include</span><span class="pl-cpf">&lt;stdio.h&gt;</span><span class="pl-cp"></span>

<span class="pl-kt">int</span> <span class="pl-nf">main</span><span class="pl-p">(){</span>
	<span class="pl-kt">int</span> <span class="pl-n">n</span><span class="pl-p">,</span><span class="pl-n">a</span><span class="pl-p">[</span><span class="pl-mi">105</span><span class="pl-p">],</span><span class="pl-n">dp</span><span class="pl-p">[</span><span class="pl-mi">105</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-p">{</span><span class="pl-mi">0</span><span class="pl-p">},</span><span class="pl-n">dpi</span><span class="pl-p">,</span><span class="pl-n">dp2</span><span class="pl-p">[</span><span class="pl-mi">105</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-p">{</span><span class="pl-mi">0</span><span class="pl-p">},</span><span class="pl-n">max</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">;</span>
	<span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">n</span><span class="pl-p">);</span>
	<span class="pl-kt">int</span> <span class="pl-n">i2</span><span class="pl-o">=</span><span class="pl-n">n</span><span class="pl-p">;</span>
	<span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">n</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">){</span>
		<span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">a</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]);</span>
		<span class="pl-n">dp</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span>
		<span class="pl-n">dp2</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span>
		<span class="pl-n">i2</span><span class="pl-o">--</span><span class="pl-p">;</span>
	<span class="pl-p">}</span>
	
	<span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">n</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">){</span>
		<span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">j</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">j</span><span class="pl-o">&lt;</span><span class="pl-n">i</span><span class="pl-p">;</span><span class="pl-n">j</span><span class="pl-o">++</span><span class="pl-p">){</span>
			<span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">dp</span><span class="pl-p">[</span><span class="pl-n">j</span><span class="pl-p">]</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-o">&gt;</span><span class="pl-n">dp</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">&amp;&amp;</span><span class="pl-n">a</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">&gt;</span><span class="pl-n">a</span><span class="pl-p">[</span><span class="pl-n">j</span><span class="pl-p">]){</span>
				<span class="pl-n">dp</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">dp</span><span class="pl-p">[</span><span class="pl-n">j</span><span class="pl-p">]</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">;</span>
			<span class="pl-p">}</span>
		<span class="pl-p">}</span>
		<span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">dp</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">&gt;</span><span class="pl-n">dpi</span><span class="pl-p">){</span>
			<span class="pl-n">dpi</span><span class="pl-o">=</span><span class="pl-n">dp</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">];</span>
		<span class="pl-p">}</span>
	<span class="pl-p">}</span>
	
	<span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-n">n</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&gt;=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">--</span><span class="pl-p">){</span>
		<span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">j</span><span class="pl-o">=</span><span class="pl-n">n</span><span class="pl-p">;</span><span class="pl-n">j</span><span class="pl-o">&gt;</span><span class="pl-n">i</span><span class="pl-p">;</span><span class="pl-n">j</span><span class="pl-o">--</span><span class="pl-p">){</span>
			<span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">dp2</span><span class="pl-p">[</span><span class="pl-n">j</span><span class="pl-p">]</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-o">&gt;</span><span class="pl-n">dp2</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">&amp;&amp;</span><span class="pl-n">a</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">&gt;</span><span class="pl-n">a</span><span class="pl-p">[</span><span class="pl-n">j</span><span class="pl-p">]){</span>
				<span class="pl-n">dp2</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">dp2</span><span class="pl-p">[</span><span class="pl-n">j</span><span class="pl-p">]</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">;</span>
			<span class="pl-p">}</span>
		<span class="pl-p">}</span>
	<span class="pl-p">}</span>
	<span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">n</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">){</span>
		<span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">dp</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">+</span><span class="pl-n">dp2</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">-</span><span class="pl-mi">1</span><span class="pl-o">&gt;</span><span class="pl-n">max</span><span class="pl-p">){</span>
			<span class="pl-n">max</span><span class="pl-o">=</span><span class="pl-n">dp</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">+</span><span class="pl-n">dp2</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">-</span><span class="pl-mi">1</span><span class="pl-p">;</span>
		<span class="pl-p">}</span>
	<span class="pl-p">}</span>
	<span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d&quot;</span><span class="pl-p">,</span><span class="pl-n">n</span><span class="pl-o">-</span><span class="pl-n">max</span><span class="pl-p">);</span>
<span class="pl-p">}</span>
</cpde></pre></div>